implementation math *800

Please click on ads to support us..

Python Code:

n, k, t = map(int, input().split())

print(t if t <= k else k if k < t < n else n+k-t)

C++ Code:

/**

 * code generated by JHelper

 * More info: https://github.com/AlexeyDmitriev/JHelper

 * @author yassin

 */



#include <bits/stdc++.h>



using namespace std;



class TaskA {

public:

    void solve(istream& in, ostream& out) {

        int n, k, t;

        in >> n >> k >> t;

        if (t <= k) {

            out << t << "\n";

        } else if (t <= n) {

            out << k << "\n";

        } else {

            out << (n + k) - t << "\n";

        }

    }

};



int main() {

	std::ios::sync_with_stdio(false); cin.tie(nullptr);

	TaskA solver;

	std::istream& in(std::cin);

	std::ostream& out(std::cout);

	solver.solve(in, out);

	return 0;

}


Comments

Submit
0 Comments
More Questions

165B - Burning Midnight Oil
17A - Noldbach problem
1350A - Orac and Factors
1373A - Donut Shops
26A - Almost Prime
1656E - Equal Tree Sums
1656B - Subtract Operation
1656A - Good Pairs
1367A - Short Substrings
87A - Trains
664A - Complicated GCD
1635D - Infinite Set
1462A - Favorite Sequence
1445B - Elimination
1656C - Make Equal With Mod
567A - Lineland Mail
1553A - Digits Sum
1359B - New Theatre Square
766A - Mahmoud and Longest Uncommon Subsequence
701B - Cells Not Under Attack
702A - Maximum Increase
1656D - K-good
1426A - Floor Number
876A - Trip For Meal
1326B - Maximums
1635C - Differential Sorting
961A - Tetris
1635B - Avoid Local Maximums
20A - BerOS file system
1637A - Sorting Parts